Parallel sorting
نویسندگان
چکیده
منابع مشابه
Parallel Bucket Sorting Algorithm
Bucket sorting algorithm achieves O(n) running time complexity in average. It is very fast compared to any comparison-based sorting algorithms that usually have a lower bound of Ω(n log n). Given an unsorted array of n positive integers, bucket sorting algorithm works by distributing the elements into m ordered buckets each contains zero or more elements. Each bucket is then sorted using either...
متن کاملRobust Massively Parallel Sorting
We investigate distributed memory parallel sorting algorithms that scale to the largest available machines and are robust with respect to input size and distribution of the input elements. The main outcome is that three sorting algorithms cover the entire range of possible input sizes. For all three algorithms we devise new low overhead mechanisms to make them robust with respect to duplicate k...
متن کاملParallel database sorting
Sorting in database processing is frequently required through the use of Order By and Distinct clauses in SQL. Sorting is also widely known in computer science community at large. Sorting in general covers internal and external sorting. Past published work has extensively focused on external sorting on uni-processors (serial external sorting), and internal sorting on multi-processors (parallel ...
متن کاملCommunication-Efficient Parallel Sorting
We study the problem of sorting n numbers on a p-processor bulk-synchronous parallel (BSP) computer, which is a parallel multicomputer that allows for general processor-to-processor communication rounds provided each processor sends and receives at most h items in any round. We provide parallel sorting methods that use internal computation time that is O(*) and a number of communication rounds ...
متن کاملParallel Suffix Sorting
We present a parallel algorithm for lexicographically sorting the suffixes of a string. Suffix sorting has applications in string processing, data compression and computational biology. The ordered list of suffixes of a string stored in an array is known as Suffix Array, an important data structure in string processing and computational biology. Our focus is on deriving a practical implementati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1983
ISSN: 0166-218X
DOI: 10.1016/0166-218x(83)90095-1